Clipless dual-space bounds for faster stochastic rasterization
نویسندگان
چکیده
منابع مشابه
Hyperplane Culling for Stochastic Rasterization
We present two novel culling tests for rasterization of simultaneous depth of field and motion blur. These tests efficiently reduce the set of xyuvt samples that need to be coverage tested within a screen space tile. The first test finds linear bounds in utand vt-space using a separating line algorithm. We also derive a hyperplane in xyuvtspace for each triangle edge, and all samples outside of...
متن کاملPer-Vertex Defocus Blur for Stochastic Rasterization
We present user-controllable and plausible defocus blur for a stochastic rasterizer. We modify circle of confusion coefficients per vertex to express more general defocus blur, and show how the method can be applied to limit the foreground blur, extend the in-focus range, simulate tilt-shift photography, and specify per-object defocus blur. Furthermore, with two simplifying assumptions, we show...
متن کاملLine Segment Rasterization in N-dimensional Space Line Segment Rasterization in N-dimensional Space
The rapid development of scanning and measuring hardware for medical imaging and for scientiic experiments, the introduction of animation techniques into common use have created the need to understand n-dimensional raster geometry, where n > 3. After a brief review of continuous geometry in R n , this paper presents the discrete regular structure called a hyperlattice used for deening n-dimensi...
متن کاملImproved Dual-Space Bounds for Simultaneous Motion and Defocus Blur
Our previous paper on stochastic rasterization [Laine et al. 2011] presented a method for constructing time and lens bounds to accelerate stochastic rasterization by skipping the costly 5D coverage test. Although the method works for the combined case of simultaneous motion and defocus blur, its efficiency drops when significant amounts of both effects are present. In this paper, we describe a ...
متن کاملSpace Bounds for Resolution
We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the former de nition [11] the space required for the resolution of any unsatis able formula in CNF is linear in the number of clauses. The new de nition allows a much ner analysis of the space in the refutation, ranging from constant to linear space. Moreover, the new de nit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2011
ISSN: 0730-0301
DOI: 10.1145/2010324.1965001